INFINITARY TABLEAU FOR SEMANTIC TRUTH
نویسندگان
چکیده
منابع مشابه
Infinitary Tableau for Semantic Truth
We provide infinitary proof theories for three common semantic theories of truth: strong Kleene, van Fraassen supervaluation and Cantini supervaluation. The value of these systems is that they provide an easy method of proving simple facts about semantic theories. Moreover we shall show that they also give us a simpler understanding of the computational complexity of these definitions and provi...
متن کاملRule Refinement for Semantic Tableau Calculi
This paper investigates refinement techniques for semantic tableau calculi. The focus is on techniques to reduce branching in inference rules and thus allow more effective ways of carrying out deductions. We introduce an easy to apply, general principle of atomic rule refinement, which depends on a purely syntactic condition that can be easily verified. The refinement has a wide scope, for exam...
متن کاملSemantic Tableau for Control of PLTL Formulae1
Akash Deshpande and Pravin Varaiya [email protected], [email protected] Department of Electrical Engineering and Computer Sciences University of California at Berkeley, Berkeley, California 94720 Abstract We describe the propositional linear temporal logic (PLTL) formalism and introduce the notions of observations, actions and control in PLTL. We develop the 0-lag and 0-lead possi...
متن کاملEfficient Semantic Tableau Generation for Abduction in
Abduction is a backward chaining inference, finding the best explanations of an observation with regard to a knowledge base in a two-steps process: i) hypotheses generation, and ii) explanations selection according to a minimality criterion. A propositional abduction problem P is a tuple 〈V,O, T 〉 [3], where V is a set of variables, T denotes the background knowledge of an application domain, O...
متن کاملBDD-Tableau: Combining Rich Semantic Structures with Tableau-based Search for Description Logic Reasoning
Description Logics (DLs) [1] are a family of well-understood logic-based knowledge representation frameworks. They have a wide range of applications, but are most widely known as the basis for ontology languages such as OWL. DLs are usually designed in such a way that relevant reasoning tasks (e.g. concept subsumption) are decidable. Respective reasoning algorithms have been studied, implemente...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Review of Symbolic Logic
سال: 2015
ISSN: 1755-0203,1755-0211
DOI: 10.1017/s175502031500012x